Left-To-Right Parsing and Bilexical Context-Free Grammars
نویسندگان
چکیده
We compare the asymptotic time complexity of left-to-right and bidirectional parsing techniques for bilexical context-free grammars, a grammar formalism that is an abstraction of language models used in several state-of-the-art real-world parsers. We provide evidence that left-to-right parsing cannot be realised within acceptable time-bounds if the so called correct-prefix property is to be ensured. Our evidence is based on complexity results for the representation of regular languages.
منابع مشابه
Splittability of Bilexical Context-Free Grammars is Undecidable
Bilexical context-free grammars (2-LCFGs) have proved to be accurate models for statistical natural language parsing. Existing dynamic programming algorithms used to parse sentences under these models have running time of O(|w|4), where w is the input string. A 2-LCFG is splittable if the left arguments of a lexical head are always independent of the right arguments, and vice versa. When a 2-LC...
متن کاملEecient Parsing for Bilexical Context-free Grammars and Head Automaton Grammars
Word Count: 3199 (using detex 2.6) Under consideration for other conferences (specify)? no Abstract Several recent stochastic parsers use bilexical grammars, where each word type idiosyncratically prefers particular complements with particular head words. We present O(n 4) parsing algorithms for two bilexical formalisms, improving the previous upper bounds of O(n 5). Also, for a common special ...
متن کاملEcient Parsing for Bilexical Context-free Grammars and Head Automaton Grammars
Several recent stochastic parsers use bilexical grammars, where each word type idiosyncratically prefers particular complements with particular head words. We present O(n) parsing algorithms for two bilexical formalisms, improving the prior upper bounds of O(n). For a common special case that was known to allow O(n) parsing (Eisner, 1997), we present an O(n) algorithm with an improved grammar c...
متن کاملcient Parsing for Bilexical Context - Free Grammarsand Head Automaton Grammars
Several recent stochastic parsers use bilexical grammars, where each word type idiosyncrat-ically prefers particular complements with particular head words. We present O(n 4) parsing algorithms for two bilexical formalisms, improving the prior upper bounds of O(n 5). For a common special case that was known to allow O(n 3) parsing (Eisner, 1997), we present an O(n 3) algorithm with an improved ...
متن کاملEfficient Parsing for Bilexical Context-Free Grammars and Head Automaton Grammars
Several recent stochastic parsers use bilexical grammars, where each word type idiosyncratically prefers particular complements with particular head words. We present O(n) parsing algorithms for two bilexical formalisms, improving the prior upper bounds of O(n). For a common special case that was known to allow O(n) parsing (Eisner, 1997), we present an O(n) algorithm with an improved grammar c...
متن کامل